Orthogonal double covers of complete bipartite graphs
نویسندگان
چکیده
Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for all i ∈ {1, . . . , n}, then H is called an ODC of Kn,n by G. In this paper, we establish a product construction for ODCs of complete bipartite graphs.
منابع مشابه
On Cartesian Products of Orthogonal Double Covers
Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, where G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H and share no edges whenever the corresponding vertices are nonadjacent in H. In this paper, we are concerned with ...
متن کاملA note on orthogonal double covers of complete bipartite graphs by a special class of six caterpillars
We construct orthogonal double covers of Kn,n by Pm+1 ∪∗ Sn−m, where n and m are integers, 2 ≤ m ≤ 10, m ≤ n and Pm+1 ∪∗ Sn−m is a tree obtained from the path Pm+1 with m edges and a star Sn−m with n − m edges by identifying an end-vertex of Pm+1 with the center of Sn−m.
متن کاملGeneral Symmetric Starter of Orthogonal Double Covers of Complete Bipartite Graph
An orthogonal double cover (ODC) of the complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs. In this paper, we consider the case where the graph to be covered twice is the complete bipartite graph Kmn,mn (for any values ofm,n) and all graphs in the collection are isomorphic to certa...
متن کاملGeneral Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs
An orthogonal double cover (ODC) of a graph H is a collection ( ) { } v G v V H : = ∈ of ( ) V H subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC of H is cyclic (CODC) if the cyclic group of order ( ) V H is a subgroup of the automorphism group of . In this paper, we introduce a general orthogonal la...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 49 شماره
صفحات -
تاریخ انتشار 2011